Sharp ULP rounding error bound for the hypotenuse function
نویسنده
چکیده
The hypotenuse function, z = √ x2 + y2, is sometimes included in math library packages. Assuming that it is being computed by a straightforward algorithm, in a binary floating point environment, with round to nearest rounding mode, a sharp roundoff error bound is derived, for arbitrary precision. For IEEE single precision, or higher, the bound implies that |z − z| < 1.222 ulp(z) and |z − z| < 1.222 ulp(z). Numerical experiments indicate that this bound is sharp and cannot be improved.
منابع مشابه
A Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کاملTriangles with prime hypotenuse
The sequence 3, 5, 9, 11, 15, 19, 21, 25, 29, 35, . . . consists of odd legs in right triangles with integer side lengths and prime hypotenuse. We show that the upper density of this sequence is zero, with logarithmic decay. The same estimate holds for the sequence of even legs in such triangles. We expect our upper bound, which involves the Erdős–Ford–Tenenbaum constant, to be sharp up to a do...
متن کاملWorst Cases for the Exponential Function in the IEEE 754r decimal64 Format
We searched for the worst cases for correct rounding of the exponential function in the IEEE 754r decimal64 format, and computed all the bad cases whose distance from a breakpoint (for all rounding modes) is less than 10 ulp, and we give the worst ones. In particular, the worst case for |x| ≥ 3 × 10 is exp(9.407822313572878 × 10) = 1.098645682066338 5 0000000000000000 278 . . .. This work can b...
متن کاملError Estimation of Floating-point Summation and Dot Product
We improve the well-known Wilkinson-type estimates for the error of standard floating-point recursive summation and dot product by up to a factor 2. The bounds are valid when computed in rounding to nearest, no higher order terms are necessary, and they are best possible. For summation there is no restriction on the number of summands. The proofs are short by using a new tool for the estimation...
متن کاملConvergence Analysis of Inexact Rayleigh Quotient Iteration
We consider the computation of the smallest eigenvalue and associated eigenvector of a Hermitian positive definite pencil. Rayleigh quotient iteration (RQI) is known to converge cubically, and we first analyze how this convergence is affected when the arising linear systems are solved only approximately. We introduce a special measure of the relative error made in the solution of these systems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 68 شماره
صفحات -
تاریخ انتشار 1999